Assembling molecules in ATOMIX is hard

Assembling molecules in ATOMIX is hard

It is shown that assembling molecules in the ATOMIX game can be used to simulate 0nite automata. In particular, an instance of ATOMIX is constructed that has a solution if and only if the non-emptiness intersection problem for 0nite automata is solvable. This shows that the game under consideration is PSPACE-complete, improving a recent result of H5 u6ner et al. (Lecture Notes in Computer Scien...

Assembling Mole ules in Atomix is Hard

Self-assembling amphiphilic molecules: Synthesis in simulated interstellar/precometary ices.

Interstellar gas and dust constitute the primary material from which the solar system formed. Near the end of the hot early phase of star and planet formation, volatile, less refractory materials were transported into the inner solar system as comets and interplanetary dust particles. Once the inner planets had sufficiently cooled, late accretionary infall seeded them with complex organic compo...

Slow release of molecules in self-assembling peptide nanofiber scaffold.

Biological hydrogels consisting of self-assembling peptide nanofibers are potentially excellent materials for various controlled molecular release applications. The individual nanofiber consists of ionic self-complementary peptides with 16 amino acids (RADA16, Ac-RADARADARADARADA-CONH(2)) that are characterized by a stable beta-sheet structure and undergo self-assembly into hydrogels containing...

Finding Optimal Solutions to Atomix

We present solutions of benchmark instances to the solitaire computer game Atomix found with different heuristic search methods. The problem is PSPACE-complete. An implementation of the heuristic algorithm A* is presented that needs no priority queue, thereby having very low memory overhead. The limited memory algorithm IDA* is handicapped by the fact that, due to move transpositions, duplicate...